منابع مشابه
Partition Relations for Successor Cardinals
This paper investigates the relations K+ --t (a): and its variants for uncountable cardinals K. First of all, the extensive literature in this area is reviewed. Then, some possibilities afforded by large cardinal hypotheses are derived, for example, if K is measurable, then K + + (K + K + 1, a): for every a < K +. Finally, the limitations imposed on provability in ZFC by L and by relative consi...
متن کاملWeak Partition Relations
The partition relation Ri-*0*i)ï,a, which was known to contradict the continuum hypothesis [1], is disproved without this hypothesis. For cardinals k^.co and X>1, let P{k, X) be the following partition relation: For any mapping F of the set [k]2 of unordered pairs of elements of k into X, there is a set B<=,k, of cardinality \B\ = k, such that the image of [B]2 under F is not all of X. Such a s...
متن کاملForcing Positive Partition Relations
We show how to force two strong positive partition relations on u, and use them in considering several well-known open problems. In [32] Sierpiñski proved that the well-known Ramsey Theorem [27] does not generalize to the first uncountable cardinal by constructing a partition [ío,]2 = KQ U Kx with no uncountable homogeneous sets. Sierpinski's partition has been analyzed in several directions. O...
متن کاملRelevance-Based Partition Semantics for Why-Questions
This work argues that partition semantics can be extended to cover whyquestions and their answers, and then develops such an extension. Building on Jeroen Groenendijk’s Logic of Interrogation and incorporating a theory of why-questions initially put forward by Bas van Fraassen, it provides a unified notion of contextual answerhood for both why-questions and constituent questions. Non-constructi...
متن کاملUpdate semantics for multilevel relations
In this paper we give a formal operational semantics for update operations on multilevel relations, i.e., relations in which individual data elements are classi ed at di erent levels. For this purpose, the familiar INSERT, UPDATE and DELETE operations of SQL are suitably generalized to cope with polyinstantiation. We conjecture that these operations are consistent (or sound) in that all relatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90019-x